Dynamic Resource Allocation Using Views

In the dynamic resource allocation problem, resources have to be allocated to a set of processes whose requests vary over time. We solve this problem through the idea of views. A view of a dynamic graph is a collection of static local views, where a local view deenes the neighborhood of a process. We specify the requirements of view computation, and present algorithms for computation of views. Later, we combine views with existing solutions to static resource allocation and (+ 1)-coloring to solve the dynamic problem. The time and message complexities of the resulting algorithm depend minimally on global parameters.